Interference Identification for Time-Varying Polyhedra

نویسندگان

چکیده

Identification of when and where moving areas intersect is an important problem in maritime operations air traffic control. This can become particularly complicated considering large numbers objects, taking into account the curvature earth. In this paper, we present approach to conflict identification as a series stages earlier are fast, but may result false detection conflict. These early used reduce number potential pairs for later stages, which slower, more precise. Our generally applicable objects piece-wise straight lines on 2D plane, specific case Mercator Projection transform along rhumb earth fit our approach. We several examples demonstrate methods, well quantify empirical time complexity by using randomly generated areas.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiuser interference cancellation in time-varying channels.

In this letter, an adaptive time-reversal multichannel combiner is embedded within an iterative successive interference cancellation receiver. With the addition of matching pursuit, a sparse channel estimation technique, the combined receiver is shown to provide both temporal interference cancellation as well as spatial interference suppression in decoding simultaneous transmissions from separa...

متن کامل

Identification of Time Varying Systems

The article outlines the development of time variable parameter (TVP) estimation as an approach to modeling nonstationary dynamic systems. It then describes one of the latest methods for estimating time variable parameters in dynamic auto-regressive, exogenous variables (DARX) and dynamic transfer function (DTF) models. In the case of DARX models, the estimation methodology is based on standard...

متن کامل

Approximation Solutions for Time-Varying Shortest Path Problem

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...

متن کامل

Identification of time-varying linear channels

In this paper, we present a new method for on-line identification of time-varying FIR channels. Two conditionally coupled estimators are proposed. In both cases an augmented-state adaptive Kalman filter is employed for tracking the time-varying channel and estimating the mean channel response. Coupled to the Kalman filter is an algorithm for estimating the parameters of the underlying auto-regr...

متن کامل

Identification of Time Varying Stochastic Systems

1 Abstract This paper presents and discusses the simulation of time stochastic ARMA systems and the development of an oo line identiication based on a prediction error method combined with exponential forgetting. The simulation involves diierent stages, starting with the simulation of the Gaussian white noise as an input to the original system and, the simulation with a combined signal and Gaus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3118954